Fast evaluation of logarithms in fields of characteristic two
نویسنده
چکیده
A method for determining logarithms in GF (2”) is presented. Its asymptotic running time is O(exp ( S3 log213 n)) for a small constant c, while, by comparison, Adleman’s scheme runs in time O(exp(c n ’ I/’ log”’ n)). Tbe ideas give a dramatic improvement even for moderate-sized fields such as GF (2l*‘), and make (harely) possible computations in fields of size around 2400. The method is not applicable to GF (q) for a large prime q.
منابع مشابه
Indiscreet logarithms in finite fields of small characteristic
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being of subexponential complexity. In this expository article we describe the key insights and constructions which culminated in two independent q...
متن کاملThe Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
In this paper, we propose two variants of the Number Field Sieve (NFS) to compute discrete logarithms in medium characteristic finite fields. We consider algorithms that combine two ideas, namely the Multiple variant of the Number Field Sieve (MNFS) taking advantage of a large number of number fields in the sieving phase, and two recent polynomial selections for the classical Number Field Sieve...
متن کاملAlgorithmes de calcul de logarithmes discrets dans les corps finis
Computing discrete logarithms is a fundamental task for public key cryptanalysis. Themere existence of a subexponential algorithm for this purpose is not sufficient to definitely ruleon the security level provided by some cryptosystem. Assessing state-of-the-art cryptanalysiscalls for a thorough evaluation process. This dissertation contributes to such an evaluation.In particula...
متن کاملMassively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the size of fields of characteristic two for which the computation of discrete logarithms is feasible. We discover several things that were previously overlooked in the implementation of Coppersmith’s algor...
متن کاملComputing discrete logarithms in cryptographically-interesting characteristic-three finite fields
Since 2013 there have been several developments in algorithms for computing discrete logarithms in small-characteristic finite fields, culminating in a quasipolynomial algorithm. In this paper, we report on our successful computation of discrete logarithms in the cryptographically-interesting characteristic-three finite field F36·509 using these new algorithms; prior to 2013, it was believed th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 30 شماره
صفحات -
تاریخ انتشار 1984